Log-Logarithmic Time Pruned Polar Coding
نویسندگان
چکیده
A pruned variant of polar coding is proposed for binary erasure channel (BEC). Fix any BEC. For sufficiently small ε > 0, we construct a series capacity achieving codes with block length N = ε-4.9, code rate R Capacity - O(ε), error probability P ε, and encoding decoding time complexity bC O(log|log ε|) per information bit. The given per-bit log-logarithmic in N, R, P. Beyond BEC, there generalization: prime q fix symmetric, q-ary-input, discrete-output memoryless channel. correction ε-constant, Over general channels, this family has the lowest among all capacity-achieving known to date.
منابع مشابه
The Logarithmic Constant : log 2
An introduction to the history of the constant log 2 and to its computation. It includes many formulas and some methods to estimate it, as well as the logarithm of any number, with few digits or to the greatest accuracy. ...by shortening the labors, doubled the life of the astronomer. Pierre Simon de Laplace (1749-1827) about logarithms. You have no idea, how much poetry there is in the calcula...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملVisual Tracking using Kernel Projected Measurement and Log-Polar Transformation
Visual Servoing is generally contained of control and feature tracking. Study of previous methods shows that no attempt has been made to optimize these two parts together. In kernel based visual servoing method, the main objective is to combine and optimize these two parts together and to make an entire control loop. This main target is accomplished by using Lyapanov theory. A Lyapanov candidat...
متن کاملEfficient Quantum Polar Coding
Polar coding, introduced 2008 by Arıkan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the asymptotic limit of large block sizes. Here we study the use of polar codes for the transmission of quantum information. Focusing on the case of qubit Pauli channel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2021
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2020.3041523